A Bayesian Approach to Optimal Sequential Experimental Design using Approximate Dynamic Programming

نویسنده

  • Xun Huan
چکیده

Experimental data play an essential role in developing and refining models of physical systems. Not all experimental results are equally useful, and some experiments can be much more valuable than others. Well-chosen experiments can thus lead to substantial resource savings. Optimal experimental design seeks to quantify and maximize the value of experimental data. Common current practice for designing multiple experiments consists of suboptimal approaches: open-loop design that chooses all experiments simultaneously, and greedy design that optimally selects the next experiment without accounting for the future. In this thesis, we develop a rigorous formulation in a closed-loop dynamic programming (DP) framework that yields the true optimal sequence of experiments under the uncertainty of their results. The framework is suitable for nonlinear models and for the experimental purpose of Bayesian parameter inference. Furthermore, we develop a set of numerical tools that solve the DP design problem with particular attention to approximation methods for computationally intensive models. These tools include various methods of approximate dynamic programming, as well as numerical techniques such as polynomial surrogates and stochastic optimization that accelerate the computations. In this thesis, the superiority of the DP design is demonstrated in a simple linear-Gaussian model problem. Future work will apply the DP design framework to a realistic application problem involving optimal sensor placement in a convection-diffusion field.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequential Bayesian optimal experimental design via approximate dynamic programming

The design of multiple experiments is commonly undertaken via suboptimal strategies, such as batch (open-loop) design that omits feedback or greedy (myopic) design that does not account for future effects. This paper introduces new strategies for the optimal design of sequential experiments. First, we rigorously formulate the general sequential optimal experimental design (sOED) problem as a dy...

متن کامل

Numerical Approaches for Sequential Bayesian Optimal Experimental Design

Experimental data play a crucial role in developing and refining models of physical systems. Some experiments can be more valuable than others, however. Well-chosen experiments can save substantial resources, and hence optimal experimental design (OED) seeks to quantify and maximize the value of experimental data. Common current practice for designing a sequence of experiments uses suboptimal a...

متن کامل

Cost Analysis of Acceptance Sampling Models Using Dynamic Programming and Bayesian Inference Considering Inspection Errors

Acceptance Sampling models have been widely applied in companies for the inspection and testing the raw material as well as the final products. A number of lots of the items are produced in a day in the industries so it may be impossible to inspect/test each item in a lot. The acceptance sampling models only provide the guarantee for the producer and consumer that the items in the lots are acco...

متن کامل

Integrative Cell Formation and Layout Design in Cellular Manufacturing Systems

This paper proposes a new integrative view of manufacturing cell formation and both inter-cell and intra-cell layout problems. Cells formation and their popular bi-directional linear layout are determined simultaneously through a Dynamic Programming algorithm (with the objective of minimizing the inter-cell flow cost under a cell size constraint). This Dynamic Programming algorithm is implement...

متن کامل

A New Approach to Distribution Fitting: Decision on Beliefs

We introduce a new approach to distribution fitting, called Decision on Beliefs (DOB). The objective is to identify the probability distribution function (PDF) of a random variable X with the greatest possible confidence. It is known that f X is a member of = { , , }. 1 m S f L f To reach this goal and select X f from this set, we utilize stochastic dynamic programming and formulate this proble...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013